Finite orthogonal symmetry

Orthogonal systems in finite graphs

Let Γ be a finite graph and GΓ be the corresponding free partially commutative group. In this paper we construct orthogonality theory for graphs and free partially commutative groups. The theory developed here provides tools for the study of the structure of the centraliser lattice of partially commutative groups.

Orthogonal vs Non-Orthogonal Multiple Access with Finite Input Alphabet and Finite Bandwidth

For a two-user Gaussian multiple access channel (GMAC), frequency division multiple access (FDMA), a well known orthogonal-multiple-access (O-MA) scheme has been preferred to non-orthogonal-multiple-access (NO-MA) schemes since FDMA can achieve the sum-capacity of the channel with only single-user decoding complexity [Chapter 14, Elements of Information Theory by Cover and Thomas]. However, wit...

Chiral Symmetry in Finite Nuclei

We have calculated the properties of finite nuclei over a wide mass range using chiral Lagrangians and dimensional-power-counting techniques to constrain the absolute and relative magnitudes of the various in-medium N-body forces that we have tested. Specifically, using power-counting techniques refined by Weinberg and later used by Lynn, we have investigated the physical content and convergenc...

Symmetry conditions and finite mechanisms

Using group representation theory, a simplified criterion for the detection of finite symmetric mechanisms is presented.

Tutorial Orthogonal Collocation on Finite Elements